Multigrid Methods for Obstacle Problems
نویسنده
چکیده
In this review, we intend to clarify the underlying ideas and the relations between various multigrid methods ranging from subset decomposition, to projected subspace decomposition and truncated multigrid. In addition, we present a novel globally convergent inexact active set method which is closely related to truncated multigrid. The numerical properties of algorithms are carefully assessed by means of a degenerate problem and a problem with a complicated coincidence set.
منابع مشابه
Multigrid Methods for Obstacle Problems
Obstacle problems can be posed as elliptic variational inequalities, complementarity inequalities and Hamilton-Jacobi-Bellman (HJB) partial differential equations (PDEs). In this paper, we propose a multigrid algorithm based on the full approximate scheme (FAS) for solving the membrane constrained obstacle problems and the minimal surface obstacle problems in the formulations of HJB equations. ...
متن کاملA Projected Algebraic Multigrid Method for Linear Complementarity Problems
We present an algebraic version of an iterative multigrid method for obstacle problems, called projected algebraic multigrid (PAMG) here. We show that classical algebraic multigrid algorithms can easily be extended to deal with this kind of problem. This paves the way for efficient multigrid solution of obstacle problems with partial differential equations arising, for example, in financial eng...
متن کاملMonotone Multigrid Methods for Elliptic Variational Inequalities I
We derive fast solvers for discrete elliptic variational inequalities of the rst kind (obstacle problems) as resulting from the approximation of related continuous problems by piecewise linear nite elements. Using basic ideas of successive subspace correction, we modify well-known relaxation methods by extending the set of search directions. Extended underrelaxations are called monotone multigr...
متن کاملMonotone Multigrid Methods for Elliptic Variational Inequalities I 1
We derive fast solvers for discrete elliptic variational inequalities of the rst kind (obstacle problems) as resulting from the approximation of related continuous problems by piecewise linear nite elements. Using basic ideas of successive subspace correction, we modify well{known relaxation methods by extending the set of search directions. Extended under-relaxations are called monotone multig...
متن کاملAdaptive Monotone Multigrid Methods for some Non{Smooth Optimization Problems
We consider the fast solution of non{smooth optimization problems as resulting for example from the approximation of elliptic free boundary problems of obstacle or Stefan type. Combining well{known concepts of successive subspace correction methods with convex analysis, we derive a new class of multigrid methods which are globally convergent and have logarithmic bounds of the asymptotic converg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008